Confluence. Introduction

Introduction: Rethinking the Disciplinary Confluence of Anthropology and Literary Studies

Herbrand-Confluence

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs. We analyze which witnesses they choose for which quantifiers, or in other words: we only consider the Herbrand-d...

Typing Confluence

We investigate con uence properties for concurrent systems of message-passing processes, because such properties have proved to be useful for a variety of applications, ranging from reasoning about concurrent objects to mobile and high-speed telecommunication protocols. Roughly, con uence means that for every two computations starting from a common system state, it is possible to continue the c...

Opérateurs de Confluence

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change : revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as p...

Modularity of Confluence - Constructed

We present a novel proof of Toyama’s famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in that it factors through the decreasing diagrams technique for abstract rewriting systems, is constructive in that it gives a construction for the converging rewrite sequences given a pair of diverging rewrite sequences, and ...